Node Disjoint Multipath Routing Approach for Controlling Congestion in MANETs

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Nodedisjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery and working of node disjoint multipath protocol

An Improvement in Congestion Control Using Multipath Routing in Manet

The ad hoc connections, which opens many opportunities for MANET applications. In ad hoc network nodes are movable and there is no centralised management. Routing is an important factor in mobile ad hoc network which not only works well with a small network, but also it can also work well if network get expanded dynamically. Routing in Manets is a main factor considered among all the issues. Mobile nodes in Manet have limited transmission capacity, they intercommunicate by multi hop relay. Multi hop routing have many challenges such as limited wireless bandwidth, low device power, dynamically changing network topology, and high vulnerability to Failure. To answer those challenges, many routing algorithms in Manets were proposed. But one of the problems in routing algorithm is congestion which decreases the overall performance of the network so in this paper we are trying to identify the best routing algorithm which will improve the congestion control mechanism among all the Multipath routing protocols